#include "BSTree.h"

int main()
{
	BSTree<int> tree;
	int a[10] = { 5, 3, 7, 1, 4, 6, 8, 0, 2, 9 };
	for (auto item : a)
	{
		tree.insertR(item);
	}
	tree.inOrder();
	
	tree.eraseR(8);
	tree.eraseR(3);
	tree.eraseR(5);
	tree.eraseR(2);
	tree.eraseR(9);
	tree.eraseR(4);
	tree.eraseR(6);
	tree.eraseR(0);
	tree.eraseR(7);
	tree.erase(1);
	tree.inOrder();
	return 0;
}